A conditional p-hub location problem with attraction functions
نویسندگان
چکیده
Available online 9 December 2008
منابع مشابه
A Reliable Multi-objective p-hub Covering Location Problem Considering of Hubs Capabilities
In the facility location problem usually reducing total transferring cost and time are common objectives. Designing of a network with hub facilities can improve network efficiency. In this study a new model is presented for P-hub covering location problem. In the p-hub covering problem it is attempted to locate hubs and allocate customers to established hubs while allocated nodes to hubs are in...
متن کاملMultimodal Transportation p-hub Location Routing Problem with Simultaneous Pick-ups and Deliveries
Centralizing and using proper transportation facilities cut down costs and traffic. Hub facilities concentrate on flows to cause economic advantage of scale and multimodal transportation helps use the advantage of another transporter. A distinctive feature of this paper is proposing a new mathematical formulation for a three-stage p-hub location routing problem with simultaneous pick-ups and de...
متن کاملMathematical model for P-hub location problem under simultaneous disruption
The optimal locating of facilities has large effects on economic benefits, providing satisfactory service and levels of customer satisfaction. One of the new topics discussed in location problems is hub location and hub facilities are subject to unpredictable disruptions. This paper proposes a nonlinear integer model for reliable single allocation hub location problem that considers backup hub,...
متن کاملA Congested Double Path Approach for a Hub Location-allocation Problem with Service Level at Hubs
In this paper an uncapacitated multiple allocation p-hub median problem is discussed. The model minimizes the transportation cost based on inventory service level at hubs through double paths between hubs. Inventory service level is defined as the percent of inventory shortage of vehicles at hubs according to passengers demand and replenishment time of vehicles. A real data from 25 nodes of mun...
متن کاملمدلبندی و حل مساله ماکزیمم پوشش p -هاب تک تخصیصی با پوشش تدریجی
P-hub maximal covering location problem is one of the most commonly used location- allocation problems. In this problem, the goal is to determine the best location for the hubs such that the covered demand is maximized by considering the predefined coverage radius. In classical hub problems, if the distance between the origin and destination is less than this radius, coverage is possible; other...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & OR
دوره 36 شماره
صفحات -
تاریخ انتشار 2009